SBT: SatBox with Theories

Recent advances in SAT solvers based on CNF have focused, in particular, on innovative techniques for Boolean constraint propagation (BCP), variable selection, and back-jumping with conflict-driven learning. These techniques have proved to be critical for the high performance of SAT solvers. A great effort by the SAT community has been made to present these SAT techniques clearly and neatly so that it will be easier for people to implement them in other systems. However, it is still a great challenge to implement these SAT techniques as efficient as the top SAT solvers, as it involves a lot of complicated details and needs a lot of fine-tuning.